An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes
نویسندگان
چکیده
We present an elementary algorithm for deciding bisimulation equivalence between arbitrary context-free processes. This improves on the state of the art algorithm of Christensen, H uttel and Stirling consisting of two semi-decision procedures running in parallel, which prohibits any complexity estimation. The point of our algorithm is the eeective construction of a nite relation characterizing all bisimula-tion equivalence classes, whose mere existence was exploited for the above mentioned decidability result.
منابع مشابه
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goal-directed rules. The decision procedure also provides the essential part of the bisimulation relation betwe...
متن کاملA Polynomial-Time Algorithm for Deciding Bisimulation Equivalence of Normed Basic Parallel Processes
A polynomial-time algorithm is presented for deciding bisimulation equivalence of so-called Basic Parallel Processes: multisets of elementary processes combined by a commutative parallel-composition operator. 1 Discussion Consider a collection (actually a multiset) of \elementary processes," each of a nite number of diierent kinds. At any instant, one of the elementary processes may spontaneous...
متن کاملPartially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between the two classes, different techniques were used in each case. We provide one polynomial-time algorithm that works in a superclass of both normed BPA and BPP. It is derived in the setting of partially-c...
متن کاملBisimulation Collapse and the Process Taxonomy
We consider the factorization (collapse) of infinite transition graphs wrt. bisimulation equivalence. It turns out that almost none of the more complex classes of the process taxonomy, which has been established in the last years, are preserved by this operation. However, for the class of BPA graphs (i.e. prefix transition graphs of context-free grammars) we can show that the factorization is e...
متن کاملBisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in Basic Process Algebra (BPA), i.e. of sequential processes generated by context-free grammars. They improved the previous decidability result of Christensen, Hüttel, Stirling (1992), since their procedure has obviously an elementary time complexity and the authors claim that a close analysis woul...
متن کامل